Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
431	Microsoft Word - fab5-paper-complete-v2.doc Add to Reading List Source URL: fab.cba.mit.edu Language: English - Date: 2010-09-15 09:18:45 Octree FO Applied mathematics Graph Scene graph Theoretical computer science Mathematics Graph theory
432	Information Theoretic Prototype Selection for Unattributed Graphs Lin Han1 , Luca Rossi2 , Andrea Torsello2 , Richard C. Wilson1 , and Edwin R. Hancock1 2 Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2015-03-30 09:05:08 Graph Matching NP-complete problems Matroid theory Graph theory Theoretical computer science Mathematics
433	Graph-Based Quadratic Optimization: A Fast Evolutionary Approach Samuel Rota Bul`oa , Marcello Pelilloa , Immanuel M. Bomzeb a DAIS - Universit` Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2011-06-06 06:05:30 Evolutionary dynamics Combinatorial optimization NP-complete problems Matching Replicator equation Clique problem Clique Evolutionary game theory Mathematical optimization Graph theory Mathematics Theoretical computer science
434	Job Cost Percent Complete Graph (Contract vs. Cumulative Billings) - Detail eDeneb 3.0 Deneb Software Inc. - AZ:18PM Add to Reading List Source URL: www.denebsoftware.com - Date: 2010-04-28 21:37:48
435	A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Samuel Rota Bul`o, and Marcello Pelillo Dipartimento di Informatica. Universit` a Ca’ Foscari di Venezia. Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:03:59 Graph operations Clique problem Clique Extremal graph theory Hypergraph Vertex cover Line graph Clique-sum Graph theory Theoretical computer science NP-complete problems
436	Bounding χ in terms of ω and ∆ for quasi-line graphs Andrew King and Bruce Reed May 8, 2007 Abstract A quasi-line graph is a graph in which the neighbourhood of any vertex Add to Reading List Source URL: andrewdouglasking.com.s3-website-us-west-2.amazonaws.com Language: English - Date: 2015-03-20 01:35:25 Line graph Clique Graph coloring Interval graph Neighbourhood Path decomposition Chordal graph Graph theory Graph operations NP-complete problems
437	Perfect Matchings in O(n log n) Time in Regular Bipartite Graphs Ashish Goel∗ Michael Kapralov† Sanjeev Khanna‡ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:49 Graph coloring Combinatorial optimization Hopcroft–Karp algorithm NP-complete problems Edge coloring Bipartite graph Eulerian path Connected component Connectivity Graph theory Mathematics Matching
438	Math. Program., Ser. A manuscript No. (will be inserted by the editor) An Exact Combinatorial Algorithm for Minimum Graph Bisection Daniel Delling · Daniel Fleischman · Add to Reading List Source URL: www.ilyaraz.org Language: English - Date: 2014-12-16 13:53:35 Spanning tree NP-complete problems Network flow Routing algorithms Graph Tree decomposition Bridge Tree Flow network Graph theory Mathematics Theoretical computer science
439	Streaming Lower Bounds for Approximating MAX-CUT Michael Kapralov∗ Sanjeev Khanna† Madhu Sudan‡ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:51 Combinatorial optimization NP-complete problems Matroid theory Matching Graph coloring Cut Maximum cut Pseudoforest Minor Graph theory Mathematics Theoretical computer science
440	Single Pass Spectral Sparsification in Dynamic Streams Michael Kapralov MIT Yin Tat Lee Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:51 Spanning tree NP-complete problems Algebraic graph theory Combinatorial optimization Matching Laplacian matrix Minimum spanning tree Connectivity Planar separator theorem Graph theory Mathematics Theoretical computer science

UPDATE